Sparse identification of nonlinear dynamical systems via reweighted ℓ1-regularized least squares
نویسندگان
چکیده
منابع مشابه
Sparse representation of cast shadows via l1-regularized least squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the set of images produced by a Lambertian scene with cast shadows can be efficiently represented by a sparse set of images generated by directional light sources. We first model an image with cast shadows as composed of a ...
متن کاملWiring Diagnostics via l1-Regularized Least Squares
A new method for detecting and locating wiring damage using time domain reflectometry with arbitrary input interrogation signals is presented. This method employs existing l1 regularization techniques from convex optimization and compressed sensing to exploit sparsity in the distribution of faults along the length of a wire, while further generalizing and improving commonly used fault detection...
متن کاملSparse Representation of Cast Shadows via `1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the set of images produced by a Lambertian scene with cast shadows can be efficiently represented by a sparse set of images generated by directional light sources. We first model an image with cast shadows as composed of a ...
متن کاملSparse channel estimation with lp-norm and reweighted l1-norm penalized least mean squares
The least mean squares (LMS) algorithm is one of the most popular recursive parameter estimation methods. In its standard form it does not take into account any special characteristics that the parameterized model may have. Assuming that such model is sparse in some domain (for example, it has sparse impulse or frequency response), we aim at developing such LMS algorithms that can adapt to the ...
متن کاملIterative Reweighted Least Squares ∗
Describes a powerful optimization algorithm which iteratively solves a weighted least squares approximation problem in order to solve an L_p approximation problem. 1 Approximation Methods of approximating one function by another or of approximating measured data by the output of a mathematical or computer model are extraordinarily useful and ubiquitous. In this note, we present a very powerful ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering
سال: 2021
ISSN: 0045-7825
DOI: 10.1016/j.cma.2020.113620